- Title
- H-supermagic labelings for firecrackers, banana trees and flowers
- Creator
- Wijaya, Rachel Wulan Nirmalasari; Semanicová-Fenovcíková, Andrea; Ryan, Joe; Kalinowski, Thomas
- Relation
- Australasian Journal of Combinatorics Vol. 69, Issue 3, p. 442-451
- Relation
- https://ajc.maths.uq.edu.au/?page=get_volumes&volume=69
- Publisher
- Centre for Discrete Mathematics & Computing, University of Queensland
- Resource Type
- journal article
- Date
- 2017
- Description
- A simple graph G = (V,E) admits an H-covering if every edge in E is contained in a subgraph H’= (V’, E’) of G which is isomorphic to H. In this case we say that G is H-supermagic if there is a bijection f : V ⋃ E → {1,...,|V| + |E|} such that f(V) = {1,...,|V|} and ∑vϵV(H')f(v)+∑vϵV(H')f(e) is constant over all subgraphs H' of G which are isomorphic to H. Extending results from [M. Roswitha and E.T. Baskoro, Amer. Inst. Physics Conf. Proc. 1450 (2012), 135-138], we show that the firecracker Fk,n is F2,n-supermagic, the banana tree Bk,n is Bk-1,n-supermagic and the flower Fn is C3-supermagic.
- Subject
- h-supermagic labelings; simple graph; h-covering; subgraph
- Identifier
- http://hdl.handle.net/1959.13/1350062
- Identifier
- uon:30480
- Identifier
- ISSN:1034-4942
- Language
- eng
- Full Text
- Reviewed
- Hits: 2633
- Visitors: 2662
- Downloads: 538
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Publisher version (open access) | 106 KB | Adobe Acrobat PDF | View Details Download |